Revisiting Weak Simulation for Substochastic Markov Chains

نویسندگان

  • David N. Jansen
  • Lei Song
  • Lijun Zhang
چکیده

The spectrum of branching-time relations for probabilistic systems has been investigated thoroughly by Baier, Hermanns, Katoen and Wolf (2003, 2005), including weak simulation for systems involving substochastic distributions. Weak simulation was proven to be sound w. r. t. the liveness fragment of the logic PCTL\X , and its completeness was conjectured. We revisit this result and show that soundness does not hold in general, but only for Markov chains without divergence. It is refuted for some systems with substochastic distributions. Moreover, we provide a counterexample to completeness. In this paper, we present a novel definition that is sound for live PCTL\X , and a variant that is both sound and complete. This technical report is an extended version of [11].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantitative methods in security and safety critical applications (NII Shonan Meeting 2012-10)

This talk shows how Markov Automata (MA) can be used to provide a truly simple semantics of Generalized Stochastic Petri Nets (GSPNs), a popular model in performance and dependability analysis that exists for more than 25 years. In fact, our approach works for all GSPNs. No restrictions are imposed on the concurrent/conflicting enabledness of immediate transitions. This contrasts with existing ...

متن کامل

Cheeger inequalities for transient Markov chains

We construct upper and lower bounds for Cheeger-type constants for transient Markov chains. We first treat the situation where there is a detailed balance condition and obtain bounds that rely exclusively on the first and second eigenvalues of the substochastic transition matrix. Secondly, we consider general substochastic transition matrices and develop bounds in this broader setting. The effi...

متن کامل

Applied Probability Trust (20 October 2015) CHEEGER INEQUALITIES FOR ABSORBING MARKOV CHAINS

We construct Cheeger-type bounds for the second eigenvalue of a substochastic transition probability matrix in terms of the Markov chain’s conductance and metastability (and vice-versa) with respect to its quasi-stationary distribution, extending classical results for stochastic transition matrices.

متن کامل

Subexponential Asymptotics of the Stationary Distributions of GI/G/1-Type Markov Chains

2 This paper considers the subexponential asymptotics of the stationary distributions of GI/G/1-type Markov chains in two cases: (i) the phase transition matrix in non-boundary levels is stochastic; and (ii) it is strictly substochastic. For the case (i), we present a weaker sufficient condition for the subexponential asymptotics than those given in the literature. As for the case (ii), the sub...

متن کامل

Estimation of the Entropy Rate of ErgodicMarkov Chains

In this paper an approximation for entropy rate of an ergodic Markov chain via sample path simulation is calculated. Although there is an explicit form of the entropy rate here, the exact computational method is laborious to apply. It is demonstrated that the estimated entropy rate of Markov chain via sample path not only converges to the correct entropy rate but also does it exponential...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013